Abstract families of length-preserving processors
نویسندگان
چکیده
منابع مشابه
Extended Abstract: Decision Problems on Iterated Length-Preserving Transducers
Finite-state transducers are simple theoretical machines that are useful in expressing easilycomputable functions and relations. This investigation considers the relations formed when transducers are iterated arbitrarily many times, a construction which is useful in model checking. In particular, we consider a number of decision problems over various classes of transducers, and attempt to deter...
متن کاملAbstract Families of Abstract Categorial Languages
Families of Abstract Categorial Languages
متن کاملDerandomization of Families of Entropy-Preserving Functions
In probabilistic computations, random bits are viewed as a resource. An important goal is to consume as little of it as possible. We study functions, which decrease the number of random bits needed by an algorithms. Loss-less condensers take as input a low entropy source, and output a source, which is statistically close to a high entropy source. This closeness is referred to as the error of th...
متن کاملStories, not Words: Abstract Datatype Processors
In response to strict power constraints and diminishing single-core performance returns, the hardware industry has shifted en masse to parallel multicore chips. In theory, parallel processing can match historic performance gains while meeting modern power budgets, but as recent studies show, that this requires near-perfect application parallelization [7]. In practice, perfect or near-perfect pa...
متن کاملAbstract Families of Context-Free Grammars
FAMILIES OF CONTEXT-FREE GRAMMARS David Workman Computer Science Department Purdue University West Lafayette, Indiana 47907 March 1974 CSD-TR-1l4
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1975
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(75)80009-2